import java.util.Arrays;
import java.util.Random;

public class Test {




    public static void orderArray(int[] array){
        for(int i = 0;i<array.length;i++){
            array[i] = i;
        }
    }

    public static void notOrderArray(int[] array){
        for(int i = 0;i<array.length;i++){
            array[i] = array.length-i;
        }
    }

    public static void notOrderArrayRandom(int[] array){
        Random random = new Random();
        for(int i = 0;i<array.length;i++){
            array[i] = random.nextInt(10_0000);
        }
    }

    public static void testInsertSort(int[] array){
        int[] tmpArray = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.insertSort(tmpArray);
        long endTime = System.currentTimeMillis();
        System.out.println("插入排序耗时"+(endTime-startTime));

    }
    public static void testShellSort(int[] array){
        int[] tmpArray = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.shellSort(tmpArray);
        long endTime = System.currentTimeMillis();
        System.out.println("希尔排序耗时"+(endTime-startTime));

    }
    public static void testSelectSort(int[] array){
        int[] tmpArray = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.selectSort(tmpArray);
        long endTime = System.currentTimeMillis();
        System.out.println("选择排序耗时"+(endTime-startTime));

    }

    public static void testHeapSort(int[] array){
        int[] tmpArray = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.heapSort(tmpArray);
        long endTime = System.currentTimeMillis();
        System.out.println("堆排序耗时"+(endTime-startTime));

    }
    public static void testQuickSort(int[] array){
        int[] tmpArray = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.quickSort(tmpArray);
        long endTime = System.currentTimeMillis();
        System.out.println("快速排序耗时"+(endTime-startTime));

    }
    public static void testQuickSortNor(int[] array){
        int[] tmpArray = Arrays.copyOf(array,array.length);
        long startTime = System.currentTimeMillis();
        Sort.quickSortNor(tmpArray);
        long endTime = System.currentTimeMillis();
        System.out.println("非递归快速排序耗时"+(endTime-startTime));

    }
    public static void main1(String[] args) {
        int[] array = new int[100000];
//        orderArray(array);

        notOrderArray(array);

//        notOrderArrayRandom(array);

//        testInsertSort(array);
//        testShellSort(array);
//        testSelectSort(array);
//        testHeapSort(array);
        testQuickSort(array);
        testQuickSortNor(array);

    }





    public static void main(String[] args) {
        int[] arr = {9,8,2,3,4,2,3,4,5,6,7,8,1};
        Sort.countSort(arr);
        System.out.println(Arrays.toString(arr));

    }
}
